A fast quantum mechanical algorithm for database search Lov K . Grover 3 C - 404 A , Bell Labs 600
ثبت نشده
چکیده
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilis-tic) will need to look at a minimum of names. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only steps. The algorithm is within a small constant factor of the fastest possible quantum mechanical algorithm.
منابع مشابه
Quantum computers can search rapidly by using almost any transformation
Lov K. Grover, 3C-404A Bell Labs, 600 Mountain Avenue, Murray Hill NJ 07974 ([email protected]) Summary A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the Walsh-Hadamard (W-H) transform. This ...
متن کاملNested quantum search and structured problems
Nicolas J. Cerf, Lov K. Grover, and Colin P. Williams W. K. Kellogg Radiation Laboratory, California Institute of Technology, Pasadena, California 91125 Information and Computing Technologies Research Section, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, California 91109 Ecole Polytechnique, Code Postale 165, Université Libre de Bruxelles, 1050 Brussels, Belgium 3C-4...
متن کاملHow hard is to search an unsorted database containing N items? A quantum mechanical algorithm
An unsorted database contains N records out of which just one satisfies a particular property. The problem is to identify that one record. Any classical algorithm, deterministic or probabilistic, will clearly take steps since on the average it will have to examine a large fraction of the N records. Quantum mechanical systems can do several operations simultaneously due to their wave like proper...
متن کاملA Lecture on Grover's Quantum Search Algorithm Version 1.1
This paper ia a written version of a one hour lecture given on Lov Grover's quantum database search algorithm. It is based on [4], [5], and [9].
متن کامل